A modified particle swarm optimization for aggregate production planning

Particle swarm optimization (PSO) originated from bird flocking models. It has become a popular research field with many successful applications. In this paper, we present a scheme of an aggregate production planning (APP) from a manufacturer of gardening equipment. It is formulated as an integer linear programming model and optimized by PSO. During the course of optimizing the problem, we discovered that PSO had limited ability and unsatisfactory performance, especially a large constrained integral APP problem with plenty of equality constraints. In order to enhance its performance and alleviate the deficiencies to the problem solving, a modified PSO (MPSO) is proposed, which introduces the idea of sub-particles, a particular coding principle, and a modified operation procedure of particles to the update rules to regulate the search processes for a particle swarm. In the computational study, some instances of the APP problems are experimented and analyzed to evaluate the performance of the MPSO with standard PSO (SPSO) and genetic algorithm (GA). The experimental results demonstrate that the MPSO variant provides particular qualities in the aspects of accuracy, reliability, and convergence speed than SPSO and GA. 2013 Elsevier Ltd. All rights reserved.